Type-Safe Covariant Specialization with Generalized Matching
نویسندگان
چکیده
منابع مشابه
Type-Safe Covariant Specialization with Generalized Matching
Matching is a relation between object types originally designed to support type-safe subclassing with binary methods. In this paper we generalize it to deal with general covariance by allowing eld and method parameter types to change covariantly in matching types. The result is a signiicant increase in the exibility of subclassing. The generalization is in a diierent direction than the recent p...
متن کاملType-Safe Compilation of Covariant Specialization: A Practical Case
Despite its lack of type safety, some typed object-oriented languages use covariant specialization for methods. In this work, we show how one may modify the semantics of languages that use covariant specialization in order to improve their type safety. We demonstrate our technique using O2, a strongly and statically typed object-oriented database programming language which uses covariant specia...
متن کاملPatBang Flexible type-safe pattern matching
Patterns provide an important dimension of expressiveness to functional programming languages because they describe a concise syntax for data destruction. However, most languages treat patterns as second-class citizens: case match expressions cannot be extended, patterns cannot be selected dynamically, and patterns cannot be composed or modified by program logic. In this paper, we present a ric...
متن کاملSpecialization and Efficiency with Labor-Market Matching∗
This paper constructs a labor-market matching model with heterogeneous workers. Due to matching frictions, there may be a mismatch of talents within a production team, forcing a worker to specialize in a task at which she is not talented. We consider a partnership model where production takes place in teams consisting of two workers. We characterize the steadystate of the matching equilibrium. ...
متن کاملUsing Generalized Language Model for Question Matching
Question and answering service is one of the popular services in the World Wide Web. The main goal of these services is to finding the best answer for user's input question as quick as possible. In order to achieve this aim, most of these use new techniques foe question matching. . We have a lot of question and answering services in Persian web, so it seems that developing a question matching m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2002
ISSN: 0890-5401
DOI: 10.1006/inco.2001.3048